431 research outputs found
Cooperative Caching for Multimedia Streaming in Overlay Networks
Traditional data caching, such as web caching, only focuses on how to boost the hit rate of requested objects in caches, and therefore, how to reduce the initial delay for object retrieval. However, for multimedia objects, not only reducing the delay of object retrieval, but also provisioning reasonably stable network bandwidth to clients, while the fetching of the cached objects goes on, is important as well. In this paper, we propose our cooperative caching scheme for a multimedia delivery scenario, supporting a large number of peers over peer-to-peer overlay networks. In order to facilitate multimedia streaming and downloading service from servers, our caching scheme (1) determines the appropriate availability of cached stream segments in a cache community, (2) determines the appropriate peer for cache replacement, and (3) performs bandwidth-aware and availability-aware cache replacement. By doing so, it achieves (1) small delay of stream retrieval, (2) stable bandwidth provisioning during retrieval session, and (3) load balancing of clients' requests among peers
Implementation Notes to OMEGA Architecture
The OMEGA architecture is an end-point architecture for provision of end-to-end QoS guarantees. The architecture principles, design, high-level implementation issues, and telerobotics experimental setup for validation of OMEGA concepts are described in my thesis (MS-CIS-95-31). In this document, I will concentrate on the structure of the software modules, their naming and content. The complete code is part of this document. There are approximately 10,000 lines of code
Network Service Customization: End-Point Perspective (Proposal)
An important problem with cell-switched technologies such as Asynchronous Transfer Mode (ATM) is the provision of customized multiplexing behavior to applications. This customization takes the form of setting up processes in the network and end-points to meet application Quality of Service (QoS) requirements.
The proposed thesis work examines the necessary components of a software architecture to provide QoS in the end-points of a cell-switched network. An architecture has been developed, and the thesis work will refine it using a driving application of the full-feedback teleoperation of a robotics system.
Preliminary experimental results indicate that such teleoperation is possible using general-purpose workstations and a lightly-loaded ATM link. An important result of the experimental portion of the thesis work will be a study of the domain of applicability for various resource management techniques
Alibi framework for identifying reactive jamming nodes in wireless LAN
Reactive jamming nodes are the nodes of the network that get compromised and become the source of jamming attacks. They assume to know any shared secrets and protocols used in the networks. Thus, they can jam very effectively and are very stealthy. We propose a novel approach to identifying the reactive jamming nodes in wireless LAN (WLAN). We rely on the half-duplex nature of nodes: they cannot transmit and receive at the same time. Thus, if a compromised node jams a packet, it cannot guess the content of the jammed packet. More importantly, if an honest node receives a jammed packet, it can prove that it cannot be the one jamming the packet by showing the content of the packet. Such proofs of jammed packets are called "alibis" - the key concept of our approach.
In this paper, we present an alibi framework to deal with reactive jamming nodes in WLAN. We propose a concept of alibi-safe topologies on which our proposed identification algorithms are proved to correctly identify the attackers. We further propose a realistic protocol to implement the identification algorithm. The protocol includes a BBC-based timing channel for information exchange under the jamming situation and a similarity hashing technique to reduce the storage and network overhead. The framework is evaluated in a realistic TOSSIM simulation where the simulation characteristics and parameters are based on real traces on our small-scale MICAz test-bed. The results show that in reasonable dense networks, the alibi framework can accurately identify both non-colluding and colluding reactive jamming nodes. Therefore, the alibi approach is a very promising approach to deal with reactive jamming nodes.published or submitted for publicationnot peer reviewe
CA-AQM: Channel-Aware Active Queue Management for Wireless Networks
In a wireless network, data transmission suffers from varied signal strengths and channel bit error rates. To ensure successful packet reception under different channel conditions, automatic bit rate control schemes are implemented to adjust the transmission bit rates based on the perceived channel conditions. This leads to a wireless network with diverse bit rates. On the other hand, TCP is unaware of such {\em rate diversity} when it performs flow rate control in wireless networks. Experiments show that the throughput of flows in a wireless network are driven by the one with the lowest bit rate, (i.e., the one with the worst channel condition). This does not only lead to low channel utilization, but also fluctuated performance for all flows independent of their individual channel conditions.
To address this problem, we conduct an optimization-based analytical study of such behavior of TCP. Based on this optimization framework, we present a joint flow control and active queue management solution. The presented channel-aware active queue management (CA-AQM) provides congestion signals for flow control not only based on the queue length but also the channel condition and the transmission bit rate. Theoretical analysis shows that our solution isolates the performance of individual flows with diverse bit rates. Further, it stabilizes the queue lengths and provides a time-fair channel allocation. Test-bed experiments validate our theoretical claims over a multi-rate wireless network testbed
CENTURION: Incentivizing Multi-Requester Mobile Crowd Sensing
The recent proliferation of increasingly capable mobile devices has given
rise to mobile crowd sensing (MCS) systems that outsource the collection of
sensory data to a crowd of participating workers that carry various mobile
devices. Aware of the paramount importance of effectively incentivizing
participation in such systems, the research community has proposed a wide
variety of incentive mechanisms. However, different from most of these existing
mechanisms which assume the existence of only one data requester, we consider
MCS systems with multiple data requesters, which are actually more common in
practice. Specifically, our incentive mechanism is based on double auction, and
is able to stimulate the participation of both data requesters and workers. In
real practice, the incentive mechanism is typically not an isolated module, but
interacts with the data aggregation mechanism that aggregates workers' data.
For this reason, we propose CENTURION, a novel integrated framework for
multi-requester MCS systems, consisting of the aforementioned incentive and
data aggregation mechanism. CENTURION's incentive mechanism satisfies
truthfulness, individual rationality, computational efficiency, as well as
guaranteeing non-negative social welfare, and its data aggregation mechanism
generates highly accurate aggregated results. The desirable properties of
CENTURION are validated through both theoretical analysis and extensive
simulations
A Network Congestion control Protocol (NCP)
The transmission control protocol (TCP) which is the dominant
congestion control protocol at the transport layer is proved to have
many performance problems with the growth of the Internet. TCP for
instance results in throughput degradation for high bandwidth delay
product networks and is unfair for flows with high round trip delays.
There have been many patches and modifications to TCP all of which
inherit the problems of TCP in spite of some performance improve-
ments.
On the other hand there are clean-slate design approaches of the
Internet. The eXplicit Congestion control Protocol (XCP) and the
Rate Control Protocol (RCP) are the prominent clean slate congestion
control protocols. Nonetheless, the XCP protocol is also proved to
have its own performance problems some of which are its unfairness
to long flows (flows with high round trip delay), and many per-packet
computations at the router. As shown in this paper RCP also makes
gross approximation to its important component that it may only give
the performance reports shown in the literature for specific choices of
its parameter values and traffic patterns.
In this paper we present a new congestion control protocol called
Network congestion Control Protocol (NCP). We show that NCP can
outperform both TCP, XCP and RCP in terms of among other things
fairness and file download times.unpublishe
Resource Management for Elastic Publish Subscribe Systems: A Performance Modeling-based Approach (Extended Version)
As more and more information systems are moving to the cloud, there have been efforts to deploy publish-subscribe (or pub/sub) systems in the cloud environment to take advantage of the elasticity of resources. As a result, there is a need to perform resource management for the cloud-based pub/sub systems that supports various types of jobs, each consists of a series of tasks, or workflow. Designing an efficient and effective resource management approach for the cloud-based pub/sub system is challenging because such an approach needs to be able to support flexible provisioning strategies, model the complex interactions between heterogeneous types of jobs, and provide dynamic resource allocation capability. In this paper, we formulate the resource management problem of elastic pub/sub system as optimization problems using different objectives functions. We model the elastic pub/sub system as a multiple-class open queuing network to derive system performance measures, and propose greedy algorithms to efficiently solve the optimization problems. Our evaluation based on simulation on real system show that our proposed solution outperforms the baseline and is robust in dealing with high-volume and fast-changing workload.Ope
Identifying malicious nodes in network-coding-based peer-to-peer streaming networks
published or submitted for publicatio
- …